منابع مشابه
An Upper Bound for B2[2] Sequences
n = b + a, a ≤ b, a, b ∈ A. n = b + a, a < b, a, b ∈ A. n = b− a, a < b, a, b ∈ A. We say that a sequence of integers A belongs to the class of B2[g] sequences if r(n) ≤ g for any integer n. To find B2[g] sequences as dense as possible is a standard problem in additive number theory ([2],[5],[6],[7]). We define F (N, g) = max{|A|, A ⊂ [1, N ], A ∈ B2[g]}. One is interested in finding precise bo...
متن کاملAn Upper Bound Analysis of Sandwich Sheet Rolling Process
In this research, flat rolling process of bonded sandwich sheets is investigated by the method of upper bound. A kinematically admissible velocity field is developed for a single layer sheet and is extended into the rolling of the symmetrical sandwich sheets. The internal, shear and frictional power terms are derived and they are used in the upper bound model. Through the analysis, the rolling ...
متن کاملAn Upper Bound on the First Zagreb Index in Trees
In this paper we give sharp upper bounds on the Zagreb indices and characterize all trees achieving equality in these bounds. Also, we give lower bound on first Zagreb coindex of trees.
متن کاملAn Upper Bound Solution for Analysis of Twist Extrusion Process with Elliptical Die Cross-section
Twist extrusion process is a rather new route to produce highly strained materials. In this process, severe plastic deformation is applied by large shear strains. In current article, required energy for twist extrusion by use of admissible velocity field together with the upper bound technique is predicted. The proposed model is capable of considering the effect of various parameters such as di...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2000
ISSN: 0097-3165
DOI: 10.1006/jcta.1999.3012